Browsing by Subject "Admissibility semantics"
Now showing items 1-1 of 1
-
Conference Object
Preferred arguments are harder to compute than stable extensions
(1999)Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...